Genetic Algorithms Based on Primal-Dual Chromosomes for Royal Road Functions
نویسنده
چکیده
Genetic algorithms (GAs) have been broadly studied by a huge amount of researchers and there are many variations developed based on Holland’s simple genetic algorithm (SGA). Inspired by the idea of diploid genotype and dominance mechanisms that broadly exists in nature, we propose a primal-dual genetic algorithm (PDGA). PDGA operates on a pair of chromosomes that are primal-dual to each other in the sense of Hamming distance in genotype. We compare the performance of PDGA over SGA based on the Royal Road functions, which are specially designed for testing GA's performance. The experiment results show that PDGA outperforms SGA on the Royal Road functions for different performance measures. Key-Words: Genetic algorithm, primal-dual chromosomes, schema, diploid, dominance, royal road functions.
منابع مشابه
'Royal-Road' Landscapes for a Dual Genetic Algorithm
Genetic Algorithms may be viewed as an optimization method based on an Artificial Evolution which is at the center of most works in Artificial Life. Since they were introduced by J. Holland during the sixties, their weaknesses and effectiveness have been intensively studied in two ways; by designing “improved GA” such as the Dual Genetic Algorithms described later, or by studying features of fu...
متن کاملFolding Genetic Algorithms : the Royal Road toward an Optimal Chromosome's Expressiveness
Previous work has revealed the so-called Dual Genetic Algorithms (DGA) to be eecient genetic algorithms using a meta-gene to symmetrically unfold the Search Space. This paper investigates Folding Genetic Algorithms as a new class of Genetic Algorithms generalizing and extending the dual approach by allowing multi-dimensional foldings and unfoldings of the search space. Along with normal genes (...
متن کاملPrimal-dual path-following algorithms for circular programming
Circular programming problems are a new class of convex optimization problems that include second-order cone programming problems as a special case. Alizadeh and Goldfarb [Math. Program. Ser. A 95 (2003) 3-51] introduced primal-dual path-following algorithms for solving second-order cone programming problems. In this paper, we generalize their work by using the machinery of Euclidean Jordan alg...
متن کاملPDGA: the Primal-Dual Genetic Algorithm
Genetic algorithms (GAs) are a class of search algorithms based on principles of natural evolution. Hence, incorporating mechanisms used in nature may improve the performance of GAs. In this paper inspired by the mechanisms of complementarity and dominance that broadly exist in nature, we present a new genetic algorithm — Primal-Dual Genetic Algorithm (PDGA). PDGA operates on a pair of chromoso...
متن کاملAdaptive Primal-Dual Genetic Algorithms in Dynamic Environments
Recently, there has been an increasing interest in applying genetic algorithms (GAs) in dynamic environments. Inspired by the complementary and dominance mechanisms in nature, a primal-dual GA (PDGA) has been proposed for dynamic optimization problems (DOPs). In this paper, an important operator in PDGA, i.e., the primal-dual mapping (PDM) scheme, is further investigated to improve the robustne...
متن کامل